package 左哥算法.ch08前缀树;

import org.junit.Test;

import java.util.PriorityQueue;

public class Ch01 {

    @Test
    public void test(){
        TrieNode root = new TrieNode();
        root.insert("abc");
        root.insert("abc");
        root.insert("bcd");
        root.insert("abc");
        System.out.println(root.search("abc"));
        root.delete("abc");
        System.out.println(root.search("abc"));
        PriorityQueue<Object> objects = new PriorityQueue<>();
    }

    @Test
    public void test01(){
        Trie root = new Trie();
        root.insert("abc");
        root.insert("abc");
        root.insert("bcd");
        root.insert("zcd");
        root.insert("abd");
        System.out.println(root.search("abc"));
    }
}
